Financial networks as directed cyclic graphs - draft

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cyclic Leveling of Directed Graphs

The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, leveling, crossing reduction, and coordinate assignment. However, there are situations where cycles must be displayed as such, e. g., distinguished cycles in the biosciences and processes that repeat in a daily or weekly turn. ...

متن کامل

Cyclic Connectivity Classes of Directed Graphs

We show that most connectivity types of simple directed graphs defined by A. Ádám in [1] are nonempty. The nonexistence of the three types that remain missing is the consequence of a fairly plausible conjecture, stated at the end of this paper. Introduction This paper gives an almost complete answer to a question raised by A. Ádám in [1] concerning the connectivity types of simple directed grap...

متن کامل

A Discovery Algorithm for Directed Cyclic Graphs

Thomas Richardson1 Logic and Computation Programme CMU, Pittsburgh PA 15213

متن کامل

Independent domination in directed graphs

In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...

متن کامل

On a cyclic connectivity property of directed graphs

Let us call a digraph D cycle-connected if for every pair of vertices u, v ∈ V (D) there exists a cycle containing both u and v. In this paper we study the following open problem introduced by Ádám. Let D be a cycle-connected digraph. Does there exist a universal edge inD, i.e., an edge e ∈ E(D) such that for everyw ∈ V (D) there exists a cycle C such thatw ∈ V (C) and e ∈ E(C)? In his 2001 pap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Corporate Ownership and Control

سال: 2014

ISSN: 1810-3057,1727-9232

DOI: 10.22495/cocv11i4c6p2